Stereo Without Search

نویسندگان

  • Carlo Tomasi
  • Roberto Manduchi
چکیده

European Conference on Computer Vision (ECCV) 1996 In its traditional formulation, stereo correspondence involves both searching and selecting. Given a feature in one scanline, the corresponding scanline in the other image is searched for the positions of similar features. Often more than one candidate is found, and the correct one must be selected. The problem of selection is unavoidable because di erent features look similar to each other. Search, on the other hand, is not inherent in the correspondence problem. We propose a representation of scanlines, called intrinsic curves, that avoids search over di erent disparities. The idea is to represent scanlines by means of local descriptor vectors, without regard for where in the image a descriptor is computed, but without losing information about the contiguity of image points. In fact, intrinsic curves are the paths that the descriptor vector traverses as an image scanline is traversed from left to right. Because the path in the space of descriptors ignores image position, intrinsic curves are invariant with respect to disparity under ideal circumstances. Establishing stereo correspondences is then reduced to the selection of one among few match candidates, a task simpli ed by the contiguity information carried by intrinsic curves. We analyze intrinsic curves both theoretically and for real images in the presence of noise, brightness bias, contrast uctuations, and moderate geometric distortion. We report preliminary experiments.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Video-Rate Stereo System by Integration of Two Algorithms with/without Occlusion Handling

This paper proposes a novel architecture for video-rate stereo machine. It is unfeasible to directly implement a video-rate machine with occlusion handling mechanism, because the computational cost for the correspondence search is higher than that of a simple polynocular stereo algorithm without occlusion handling. Our idea is to integrate two algorithms withlwithout occlusion handling mechanis...

متن کامل

Stereo by Two-Level Dynamic Programming

This paper presents a stereo algorithm using dynamic programming technique. The stereo matching problem, that is, obtaining a correspondence between right and left images, can be cast as a search problem. When a pair of stereo images is rectified, pairs of corresponding points can be searched for within the same scanlines. We call this search intra-scanline search. This intra-scanline search ca...

متن کامل

Exploration of the 3D World on the Internet Using Commodity Virtual Reality Devices

This article describes technical basics and applications of graphically interactive and online Virtual Reality (VR) frameworks. It automatically extracts and displays left and right stereo images from the Internet search engines, e.g., Google Image Search. Within a short waiting time, many 3D related results are returned to the users regarding aligned left and right stereo photos; these results...

متن کامل

A multiple-baseline stereo

This paper presents a stereo matching method which uses multiple stereo pairs with various baselines to obtain precise depth estimates without suffering from ambiguity. In stereo processing, a short baseline means that the estimated depth will be less precise due to narrow triangulation. For more precise depth estimation, a longer baseline is desired. With a longer baseline, however, a larger d...

متن کامل

Mariner 10 stereo image coverage of Mercury

A computer search was performed on all useable Mariner 10 images of Mercury for which refined camera positions and orientations are available. Over 2000 valid stereo pairs have been found. The results of this search allowed us to construct a map illustrating the available stereo coverage and the corresponding stereo height accuracy across the surface of Mercury. Examples are given to illustrate...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996